- splay constant
- splay constant Spreizkonstante f (Flüssigkristall)
English-German dictionary of Electrical Engineering and Electronics. 2013.
splay constant
Schlagen Sie auch in anderen Wörterbüchern nach:
Splay tree — A splay tree is a self balancing binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look up and removal in O(log(n)) amortized time. For many… … Wikipedia
Hunter–Saxton equation — In mathematical physics, the Hunter–Saxton equationHunter Saxton 1991] :(u t + u u x) x = frac{1}{2} , u x^2is an integrable PDE that arises in the theoretical study of nematic liquid crystals. If the molecules in the liquid crystal are initially … Wikipedia
AVL tree — In computer science, an AVL tree is a self balancing binary search tree, and it is the first such data structure to be invented. [Robert Sedgewick, Algorithms , Addison Wesley, 1983, ISBN 0 201 06672 6, page 199, chapter 15: Balanced Trees.] In… … Wikipedia
Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space … Wikipedia
Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… … Wikipedia
Tree rotation — A tree rotation is an operation on a binary search tree that changes the structure without interfering with the order of the elements. A tree rotation moves one node up in the tree and one node down. They are used to change the shape of the tree … Wikipedia
Dynamic array — Several values are inserted at the end of a dynamic array using geometric expansion. Grey cells indicate space reserved for expansion. Most insertions are fast (constant time), while some are slow due to the need for reallocation (Θ(n) time,… … Wikipedia
AVL tree — Arbre AVL Pour les articles homonymes, voir AVL. Un exemple d arbre non AVL. En informatique, les arbres AVL ont été his … Wikipédia en Français
Arbre AVL — Pour les articles homonymes, voir AVL. Un exemple d arbre non AVL. En informatique théorique, les arbres AVL ont été historiquement les premiers arbre … Wikipédia en Français
Arbre Andelson-Velskii et Landis — Arbre AVL Pour les articles homonymes, voir AVL. Un exemple d arbre non AVL. En informatique, les arbres AVL ont été his … Wikipédia en Français
Arbre avl — Pour les articles homonymes, voir AVL. Un exemple d arbre non AVL. En informatique, les arbres AVL ont été his … Wikipédia en Français
